An Improved FPT Algorithm for Independent Feedback Vertex Set
نویسندگان
چکیده
منابع مشابه
An improved FPT algorithm for Independent Feedback Vertex Set
We study the Independent Feedback Vertex Set problem — a variant of the classic Feedback Vertex Set problem where, given a graph G and an integer k, the problem is to decide whether there exists a vertex set S ⊆ V (G) such that G \ S is a forest and S is an independent set of size at most k. We present an O∗((1 +φ))-time FPT algorithm for this problem, where φ < 1.619 is the golden ratio, impro...
متن کاملFPT Algorithms for Connected Feedback Vertex Set
We study the recently introduced Connected Feedback Vertex Set (CFVS) problem from the view-point of parameterized algorithms. CFVS is the connected variant of the classical Feedback Vertex Set problem and is defined as follows: given a graph G = (V, E) and an integer k, decide whether there exists F ⊆ V , |F | ≤ k, such that G[V \ F ] is a forest and G[F ] is connected. We show that Connected ...
متن کاملDirected Feedback Vertex Set Problem is FPT
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long time open problem. In this paper, we prove that the parameterized feedback vertex set in directed graph is fixed-parameter tractable and give the first FPT algorithm of running time O((1.48k)n) for it. As the feedback arc set problem in directed graph can be transformed to a feedb...
متن کاملAn Improved Exact Algorithm for Undirected Feedback Vertex Set
A feedback vertex set in an undirected graph is a subset of vertices removal of which leaves a graph with no cycles. Razgon (SWAT 2006) gave a 1.8899n-time algorithm for finding a minimum feedback vertex set in an n-vertex undirected graph, which is the first exact algorithm for the problem that breaks the trivial barrier of 2. Later, Fomin et al. (Algorithmica 2008) improved the result to 1.75...
متن کاملAn improved parameterized algorithm for the independent feedback vertex set problem
In this paper, we develop a new parameterized algorithm for the Independent Feedback Vertex Set (IFVS) problem. Given a graph G = (V,E), the goal of the problem is to determine whether there exists a vertex subset F ⊆ V such that V − F induces a forest in G and F is an independent set. We show that there exists a parameterized algorithm that can determine whether a graph contains an IFVS of siz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2020
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-020-09973-w